Population Monte Carlo algorithms

نویسنده

  • Yukito Iba
چکیده

We give a cross-disciplinary survey on “population” Monte Carlo algorithms. In these algorithms, a set of “walkers” or “particles” is used as a representation of a high-dimensional vector. The computation is carried out by a random walk and split/deletion of these objects. The algorithms are developed in various fields in physics and statistical sciences and called by lots of different terms – “quantum Monte Carlo”, “transfer-matrix Monte Carlo”, “Monte Carlo filter (particle filter)”,“sequential Monte Carlo” and “PERM” etc. Here we discuss them in a coherent framework. We also touch on related algorithms – genetic algorithms and annealed importance sampling.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evaluating Performance of Algorithms in Lung IMRT: A Comparison of Monte Carlo, Pencil Beam, Superposition, Fast Superposition and Convolution Algorithms

Background: Inclusion of inhomogeneity corrections in intensity modulated small fields always makes conformal irradiation of lung tumor very complicated in accurate dose delivery.Objective: In the present study, the performance of five algorithms via Monte Carlo, Pencil Beam, Convolution, Fast Superposition and Superposition were evaluated in lung cancer Intensity Modulated Radiotherapy plannin...

متن کامل

Evaluating Quasi-Monte Carlo (QMC) algorithms in blocks decomposition of de-trended

The length of equal minimal and maximal blocks has eected on logarithm-scale logarithm against sequential function on variance and bias of de-trended uctuation analysis, by using Quasi Monte Carlo(QMC) simulation and Cholesky decompositions, minimal block couple and maximal are founded which are minimum the summation of mean error square in Horest power.

متن کامل

Population-based Monte Carlo algorithms

In this paper, we give a cross-disciplinary survey on “population-based” Monte Carlo algorithms. These algorithms consist of a set of “walkers” or “particles” for the representation of a high-dimensional vector and the computation is carried out by a random walk and split/deletion of these objects. The algorithms are developed in various fields in physics and statistical sciences and called by ...

متن کامل

Spatial count models on the number of unhealthy days in Tehran

Spatial count data is usually found in most sciences such as environmental science, meteorology, geology and medicine. Spatial generalized linear models based on poisson (poisson-lognormal spatial model) and binomial (binomial-logitnormal spatial model) distributions are often used to analyze discrete count data in which spatial correlation is observed. The likelihood function of these models i...

متن کامل

Population-based reversible jump Markov chain Monte Carlo

We present an extension of population-based Markov chain Monte Carlo to the transdimensional case. A major challenge is that of simulating from highand transdimensional target measures. In such cases, Markov chain Monte Carlo methods may not adequately traverse the support of the target; the simulation results will be unreliable. We develop population methods to deal with such problems, and giv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001